Refine your search
Co-Authors
Journals
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z All
Sugumaran, M.
- Indexing and Query Processing Techniques in Spatio-Temporal Data
Abstract Views :185 |
PDF Views:1
Authors
Affiliations
1 Department of Computer Science and Engineering, Manonmaniam Sundaranar University, IN
2 Department of Computer Science and Engineering, Pondicherry Engineering College, IN
1 Department of Computer Science and Engineering, Manonmaniam Sundaranar University, IN
2 Department of Computer Science and Engineering, Pondicherry Engineering College, IN
Source
ICTACT Journal on Soft Computing, Vol 6, No 3 (2016), Pagination: 1198-1217Abstract
Indexing and query processing is an emerging research field in spatio - temporal data. Most of the real-time applications such as location based services, fleet management, traffic prediction and radio frequency identification and sensor networks are based on spatio-temporal indexing and query processing. All the indexing and query processing applications is any one of the forms, such as spatio index access and supporting queries or spatio-temporal indexing method and support query or temporal dimension, while in spatial data it is considered as the second priority. In this paper, give the survey of the various uncertain indexing and query processing techniques. Most of the existing survey works on spatio-temporal are based on indexing methods and query processing, but presented separately. Both the indexing and querying are related, hence state - of - art of both the indexing and query processing techniques are considered together. This paper gives the details of spatio-temporal data classification, various types of indexing methods, query processing, application areas and research direction of spatio-temporal indexing and query processing.Keywords
Uncertain Data, Spatio-Temporal Index, Spatio-Temporal Queries, Skyline Query, Top-K Query, Nearest-Neighbor Query.- Enhanced Load Balance to Predict Fast Data Stream using E-Tree MSI Method on Cloud
Abstract Views :193 |
PDF Views:0
Authors
Affiliations
1 Bharathiar University, Coimbatore – 641046, Tamil Nadu, IN
2 Pondicherry Engineering College, Pillaichavadi – 605014, Puducherry, IN
1 Bharathiar University, Coimbatore – 641046, Tamil Nadu, IN
2 Pondicherry Engineering College, Pillaichavadi – 605014, Puducherry, IN
Source
Indian Journal of Science and Technology, Vol 9, No 16 (2016), Pagination:Abstract
Cloud computing implements virtualization processing of data service in the internet, where it delivers the conceptual, scalable platforms and applications as on data services. The important problem arises in Cloud infrastructure in storing a very large amount of data and processing on the computational load on the cloud. It is a big challenge to overcome computation complexity on cloud. An effectively predict the data streams process with load factors of ensemble model and data stream are implemented to overcome in cloud. Data stream processes on the cloud infrastructure runs with continuously varying load factors. In this work, we propose an architecture with a load balancing framework for cloud infrastructure by using the Ensemble Tree Metric Space Indexing (E-tree MSI) technique. We developed three techniques to construct our E-tree MSI technique: Fast Predictive Look-ahead Scheduling approach (FPLS) where the scheduling of Spatio-temporal data stream files takes place; Parallel Ensemble Tree Classification (PETC) which performs the process of classification operations on cloud data stream; and a Bilinear quadrilateral Mapping process which adds efficient implementation of cloud infrastructure. We have done an experimental evolution using Cloud Sim, from which it is achieved that the performance of load balancing factor is increased, the accuracy rate of classification is better and it reduced the execution time for mapping.Keywords
Cloud Security, Data Stream, E-Tree, Load Balancing, Load Factor, Mapping and Metric Space- Continuous k-Nearest Neighbor Queries in Wireless Environments
Abstract Views :160 |
PDF Views:0
Authors
M. Veeresha
1,
M. Sugumaran
1
Affiliations
1 Department of Computer Science and Engineering, Pondicherry Engineering College, Pondicherry − 605014, IN
1 Department of Computer Science and Engineering, Pondicherry Engineering College, Pondicherry − 605014, IN
Source
Indian Journal of Science and Technology, Vol 9, No 48 (2016), Pagination:Abstract
Objectives: Network Coding-based Spatial Air Index (NCSAI) has been proposed for improving query performance of continuous k-nearest neighbor queries in road networks. Methods: Due to unreliable nature of wireless links, network coding has been playing an important role in wireless environments and improves scalability and throughput. In this work,NCSAI has been adapted using XOR-based network coding because it is simple and efficient coding strategy. Findings: Experiments have been conducted for evaluating query performance, the experimental result show that performance of NCSAI better than state-of-the-art Network Partition Index (NPI). Improvements: We can improve the performance of NCSAI by adapting an efficient network coding strategies.Keywords
Continuous k-Nearest Neighbor Queries, Network Coding-Based Spatial Air Index (NCSAI), Network Partition Index (NPI), Road Networks, Wireless Environments- A Novel Air Index for Range Queries in Road Networks
Abstract Views :379 |
PDF Views:123
Authors
M. Veeresha
1,
M. Sugumaran
1
Affiliations
1 Dept. of Computer Sci. and Engg., Pondicherry Engg. College, Pondicherry, IN
1 Dept. of Computer Sci. and Engg., Pondicherry Engg. College, Pondicherry, IN
Source
International Journal of Vehicle Structures and Systems, Vol 9, No 2 (2017), Pagination: 83-86Abstract
Objective of the present work is to improve range query performance using Hybrid Spatial Air Index (HSAI). HSAI has been designed with combination of both cache management and network coding for processing range queries in road networks. HSAI has been utilized the advantage of both cache management and network coding and reduce client search space. The experiments have been conducted for evaluating performance, the experimental results show that HSAI outperform.Keywords
Hybrid Spatial Air Index, Cache Management, Network Coding, Range Queries, Road Networks.References
- D. Zhang, C.Y. Chow, Q. Li, X. Zhang and Y. Xu. 2012. SMashQ: Spatial mashup framework for k-NN queries in time-dependent road networks, Distributed Parallel Data bases, 31, 259-287. https://doi.org/10.1007/s10619-012-7110-6.
- Y. Li, and M.L. Yiu. 2015. Route-saver: Leveraging route APIs for accurate and efficient query processing at location-based services, IEEE Trans. Knowledge and Data Engg., 27, 235-249. https://doi.org/10.1109/TKDE.2014.2324597.
- H. Samet, J. Sankaranarayanan and H. Alborzi. 2008. Scalable network distance browsing in spatial databases, Proc. ACM SIGMOD Int. Conf. on Mgmt Data, 43-54. https://doi.org/10.1145/1376616.1376623.
- H. Kriegel, P. Kroger, P. Kunath, M. Renz and T. Schmidt. 2007. Proximity queries in large traffic networks, Proc. 15th Annual ACM Int. Symp. Adv. Geographic Info. Systems, 21-28. https://doi.org/10.1145/1341012.1341040.
- M.F. Mokbel, C.Y. Chow and W.G. Aref. 2006. The new casper: Query processing for location services without compromising privacy, Proc. 32nd Int. Conf. Very Large Data Bases, 763-774.
- T. Imielinski, S. Viswanathan and B.R. Badrinath. 1997. Data on air: Organization and access, IEEE Trans. Knowledge and Data Engg., 9, 353-372. https://doi.org/10.1109/69.599926.
- G. Li, Q. Zhou and J. Li. 2015. A novel scheduling algorithm for supporting periodic queries in broadcast environments, IEEE Trans. Mobile Computing, 14, 419-432. https://doi.org/10.1109/TMC.2015.2398417.
- W. Sun, Y. Qin, j. Wu, B. Zheng, Z. Zhang, P. Yu and J. Zhang. 2014. Air indexing for on-demand XML data broadcast, IEEE Trans. Parallel and Distributed Systems, 25, 1371-1381. https://doi.org/10.1109/TPDS.2013.87.
- K. Mouratidis, S. Bakiras and D. Papadias. 2009. Continuous monitoring of spatial queries in wireless broadcast environments, IEEE Trans. Mobile Computing, 8, 1297-1311. https://doi.org/10.1109/TMC.2009.14.
- B. Zheng, W.C. Lee and D.L. Lee. 2007. On searching continuous k-nearest neighbors in wireless data broadcast systems, IEEE Trans. Mobile Computing, 6, 748-761. https://doi.org/10.1109/TMC .2007.1004.
- U.L. Hou, H.J. Zhao, M.L. Yiu, Y. Li and Z. Gong. 2014. Towards online shortest path computation, IEEE Trans. Knowledge and Data Engg., 26, 1012-1025. https://doi.org/10.1109/TKDE.2013.176.
- W. Sun, C. Chen, B. Zheng, C. Chen and P. Liu. 2015. An air index for spatial query processing in road networks, IEEE Trans. Knowledge and Data Engg., 27, 382-395. https://doi.org/10.1109/TKDE.2014.2330836.
- S. Kim and S.H. Kang. 2010. Scheduling data broadcast: An efficient cut-off point between periodic and on-demand data, IEEE Communications Letters, 14, 1176-1178. https://doi.org/10.1109/LCOMM.2010.101210.101228.
- P.T. Joy and K.P Jacob. 2012. A comparative study of cache replacement policies in wireless mobile networks, Proc. Int. Symp. Adv. in Computing and Info. Tech., 609-619. https://doi.org/10.1007/978-3-642-31513-8_62.
- W.C. Peng and M.S. Chen. 2005. Design and performance studies of an adaptive cache retrieval scheme in a Mobile computing environment, IEEE Trans. Mobile Computing, 4, 29-40. https://doi.org/10.1109/TMC.2005.9.
- W.C. Peng and M.S. Chen. 2005. Shared data allocation in a mobile computing system: Exploring local and global optimization, IEEE Trans. Parallel and Distributed Systems, 16, 374-384. https://doi.org/10.1109/TPDS.2005.50.
- L. Yin and G. Cao. 2006. Supporting cooperative caching in adhoc networks, IEEE Trans. Mobile Computing, 5, 77-89. https://doi.org/10.1109/TMC.2006.15.
- Q. Zhu, D.L. Lee and W.C. Lee. 2011. Collaborative caching for spatial queries in mobile P2P networks, IEEE Int. Conf. Data Engg., 279-290.
- R. Ahlswede, N. Cai, S.Y. Li and R.W. Yeung .2000. Network information flow, IEEE Trans. Info. Theory, 46, 1204-1216. https://doi.org/10.1109/18.850663.
- Y. Sagduyu and A. Ephremides. 2008. Cross-layer optimization of MAC and network coding in wireless queuing tandem networks, IEEE Trans. Info. Theory, 54, 554-571. https://doi.org/10.1109/TIT.2007.913423.
- Y. Birk and T. Kol. 2006. Coding on demand by an informed source (ISCOD) for efficient broadcast of different supplemental data to caching clients, IEEE Trans. Info. Theory, 52, 2825-2830. https://doi.org/10.1109/TIT.2006.874540.
- C. Zhan, C. Victor, S. Lee, J. Wang and Y. Xu. 2011. Coding-based data broadcast scheduling in on-demand broadcast, IEEE Trans. Wireless Comms., 10, 3774-3783. https://doi.org/10.1109/TWC.2011.092011.101652.
- F. Li, D. Cheng, M. Hadjieleftheriou, G. Kollios and S. Teng. 2005. On trip planning queries in spatial databases, Proc. 9th Int. Conf. on Adv. Spatial Temporal Databases, 923-923. https://doi.org/10.1007/11535331_16.
- Processing of K-Nearest Neighbour Queries in Road Networks Using Spatial Air Index
Abstract Views :241 |
PDF Views:124
Authors
M. Veeresha
1,
M. Sugumaran
1
Affiliations
1 Dept. of Computer Sci. and Engg., Pondicherry Engg. College, Pondicherry, IN
1 Dept. of Computer Sci. and Engg., Pondicherry Engg. College, Pondicherry, IN
Source
International Journal of Vehicle Structures and Systems, Vol 9, No 2 (2017), Pagination: 87-90Abstract
Spatial Air Index (SAI) has been proposed for improving query performance of k-nearest neighbour queries in road networks. SAI has been effectively utilized the usage of Adaptive Cooperative Caching (ACC) and reduced search space. Experiments have been conducted for evaluated query result, the experimental result show that SAI outperform compared to state-of-the-art Network Partition Index (NPI).Keywords
Spatial Air Index, K-Nearest Neighbour Queries, Adaptive Cooperative Caching, Network Partition Index, Road Networks.References
- G. Li, Q. Zhou and J. Li. 2015. A novel scheduling algorithm for supporting periodic queries in broadcast environments, IEEE Trans. Mobile Computing, 14, 419-432. https://doi.org/10.1109/TMC.2015.2398417.
- W. Sun, Y. Qin, J. Wu, B. Zheng, Z. Zhang, P. Yu and J.Zhang. 2014. Air indexing for on-demand XML data broadcast, IEEE Trans. Parallel and Distributed Systems, 25, 1371-1381. https://doi.org/10.1109/TPDS.2013.87.
- T. Imielinski, S. Viswanathan and B.R. Badrinath. 1997. Data on air: Organization and access, IEEE Trans. Knowledge and Data Engg., 9, 353-372. https://doi.org/10.1109/69.599926.
- B. Zheng, W.C. Lee and D.L. Lee. 2007. On searching continuous k-nearest neighbors in wireless data broadcast systems, IEEE Trans. Mobile Computing, 6, 748-761. https://doi.org/10.1109/TMC.2007.1004.
- K. Mouratidis, S. Bakiras and D. Papadias. 2009. Continuous monitoring of spatial queries in wireless broadcast environments, IEEE Trans. Mobile Computing, 8, 1297-1311. https://doi.org/10.1109/TMC.2009.14.
- [[6] U.L. Hou, H.J. Zhao, M.L. Yiu, Y. Li and Z. Gong. 2014. Towards online shortest path computation, IEEE Trans. Knowledge & Data Engg., 26, 1012-1025. https://doi.org/10.1109/TKDE.2013.176.
- W. Sun, C. Chen, B. Zheng, C. Chen and P. Liu. 2015. An air index for spatial query processing in road networks, IEEE Trans. Knowledge and Data Engg., 27, 382-395. https://doi.org/10.1109/TKDE.2014.2330836.
- S. Kim and S.H. Kang. 2010. Scheduling data broadcast: An efficient cut-off point between periodic and on-demand data, IEEE Comms. Letters, 14, 1176-1178. https://doi.org/10.1109/LCOMM.2010.101210.101228.
- P.T. Joy and K.P. Jacob. 2012. A comparative study of cache replacement policies in wireless mobile networks, Proc. Int. Symp. Adv, in Computing and Info. Tech., 609-619. https://doi.org/10.1007/978-3-642-31513-8_62.
- B. Zheng, J. Xu and D. Lee. 2002. Cache invalidation and replacement strategies for location-dependent data in mobile environments, IEEE Trans. Computers, 10, 1141-1153. https://doi.org/10.1109/TC.2002.1039841.
- W.C. Peng and M.S. Chen. 2005. Design and Performance studies of an adaptive cache retrieval scheme in a mobile computing environment, IEEE Trans. Mobile Computing, 4, 29-40. https://doi.org/10.1109/TMC.2005.9.
- W.C. Peng and M.S. Chen. 2005. Shared data allocation in a mobile computing system: Exploring local and global optimization, IEEE Trans. Parallel & Distributed Systems, 16, 374-384. https://doi.org/10.1109/TPDS.2005.50.
- L. Yin and G. Cao. 2006. Supporting cooperative caching in adhoc networks. IEEE Trans. Mobile Computing, 5, 77-89. https://doi.org/10.1109/TMC.2006.15.
- Q. Zhu, D.L. Lee and W.C. Lee. 2011. Collaborative caching for spatial queries in mobile P2P networks, IEEE Int. Conf. Data Engg., 279-290.
- F. Li, D. Cheng, M. Hadjieleftheriou, G. Kollios and S.Teng. 2005. On trip planning queries in spatial databases, Proc. 9th Int. Conf. Adv. Spatial Temporal Databases, 923-923. https://doi.org/10.1007/11535331_16.
- Antidiabetic Potential of Aqueous and Alcoholic Leaf Extracts of Pithecellobium dulce
Abstract Views :176 |
PDF Views:0
Authors
Affiliations
1 Adhiparasakthi College of Pharmacy, Melmaruvathur-603319, IN
2 School of Chemical and Biotechnology, SASTRA University, Thanjavur-613402, IN
1 Adhiparasakthi College of Pharmacy, Melmaruvathur-603319, IN
2 School of Chemical and Biotechnology, SASTRA University, Thanjavur-613402, IN